abstract class $BT_NODE{ KEY < $IS_LT{KEY}, ELT,

---

Descendants

BT_NODE{_,_}

BT_NODE_DBG{_,_}

---

Public

Features

aget(i:INT): BT_NELEM{KEY,ELT,NODE};

create: SAME;

create(t:TUP{KEY,ELT}): SAME;

elt!: ELT;

find(k:KEY,stack:A_STACK{TUP{INT,NODE}}): BOOL;

findPred(stack:A_STACK{TUP{INT,NODE}});

ind!: KEY;

is_eq(n:NODE): BOOL;

joinLeft(pos:INT,stack:A_STACK{TUP{INT,NODE}});

joinRight(pos:INT,stack:A_STACK{TUP{INT,NODE}});

leftFree(stack:A_STACK{TUP{INT,NODE}}): BOOL;

leftSpare(stack:A_STACK{TUP{INT,NODE}}): BOOL;

maxSize: INT;

minSize: INT;

nodeDelete(pos:INT);

nodeInsert(n:NODE,pos:INT);

pair!: TUP{KEY,ELT};

pullLeft(pos:INT,stack:A_STACK{TUP{INT,NODE}});

pullRight(pos:INT,stack:A_STACK{TUP{INT,NODE}});

pushLeft(e:NODE,pos:INT,stack:A_STACK{TUP{INT,NODE}});

pushRight(e:NODE,pos:INT,stack:A_STACK{TUP{INT,NODE}});

rightFree(stack:A_STACK{TUP{INT,NODE}}): BOOL;

rightSpare(stack:A_STACK{TUP{INT,NODE}}): BOOL;

setItem(pos:INT,t:TUP{KEY,ELT});

setNode(pos:INT,node:NODE);

size: INT;

split(e:NODE,pos:INT): NODE;

---

The Sather Home Page

---